Tolerances Induced by Irredundant Coverings

نویسندگان

  • Jouni Järvinen
  • Sándor Radeleczki
چکیده

In this paper, we consider tolerances induced by irredundant coverings. Each tolerance R on U determines a quasiorder .R by setting x .R y if and only if R(x) ⊆ R(y). We prove that for a tolerance R induced by a covering H of U , the covering H is irredundant if and only if the quasiordered set (U,.R) is bounded by minimal elements and the tolerance R coincides with the product &R ◦.R. We also show that in such a case H = {↑m | m is minimal in (U,.R)}, and for each minimal m, we have R(m) = ↑m. Additionally, this irredundant covering H inducing R consists of some blocks of the tolerance R. We give necessary and sufficient conditions under which H and the set of R-blocks coincide. These results are established by applying the notion of Helly numbers of quasiordered sets.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Covering Numbers in Linear Algebra

We compute the minimal cardinalities of coverings and irredundant coverings of a vector space over an arbitrary field by proper linear subspaces. Analogues for affine linear subspaces are also given. Notation: The cardinality of a set S will be denoted by #S. For a vector space V over a field K , we denote its dimension by dim K . 1. LINEAR COVERINGS. Let V be a vector space over a field K . A ...

متن کامل

Rough sets determined by tolerances

We show that for any tolerance R on U , the ordered sets of lower and upper rough approximations determined by R form ortholattices. These ortholattices are completely distributive, thus forming atomistic Boolean lattices, if and only if R is induced by an irredundant covering of U , and in such a case, the atoms of these Boolean lattices are described. We prove that the ordered set RS of rough...

متن کامل

On the coverings by tolerance classes

A tolerance is a reflexive and symmetric, but not necessarily transitive, binary relation. Contrary what happens with equivalence relations, when dealing with tolerances one must distinguish between blocks (maximal subsets where the tolerance is a total relation) and classes (the class of an element is the set of those elements tolerable with it). Both blocks and classes of a tolerance on a set...

متن کامل

On the Determination of Complete Sets of Logical Functions

A procedure is described, based on a theorem of Post, for determining the nonredundant complete sets of logical functions. Kudielka and Oliva's determination of these functions for two and three variables was verified by means of this procedure in less than a minute of computer time. The procedure requires the computation of irredundant coverings, and novel features of the algorithm which was u...

متن کامل

From Irredundance to Annihilation: a Brief Overview of Some Domination Parameters of Graphs

During the last thirty years, the concept of domination in graphs has generated an impressive interest. A recent bibliography on the subject contains more than 1200 references and the number of new definitions is continually increasing. Rather than trying to give a catalogue of all of them, we survey the most classical and important notions (as independent domination, irredundant domination, k-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Fundam. Inform.

دوره 137  شماره 

صفحات  -

تاریخ انتشار 2015